/**
*      author: Y_Yao
*      created: 2024-12-14 20:56:14
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[2 * N];
int n,s;
int su;
int sum[2 * N];

void solve()
{
    cin >> n >> s;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
        a[n + i] = a[i];
        su += a[i];
    }
    for(int i = 1;i <= 2 * n;i++)
    {
        sum[i] = sum[i-1] + a[i];
    }

    s %= su;
    if(s == 0)
    {
        cout << "Yes" << endl;
        return;
    }
    unordered_set<int> hash;
    for(int r = 1;r <= 2*n;r++)
    {
        if(hash.count(sum[r] - s))
        {
            cout << "Yes" << endl;
            return;
        }
        hash.insert(sum[r]);
    }
    cout << "No" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}